Heterogeneous Distribution of Computations While Solving Linear Algebra Problems on Networks of Heterogeneous Computers

نویسندگان

  • Alexey Kalinov
  • Alexey L. Lastovetsky
چکیده

1 I n t r o d u c t i o n Progress in network technologies is making local and even global networks of computers (in particular, networks of PCs and workstations) more and more attractive for high-performance parallel computing. While developing applications for such networks it is necessary to take into account their heterogeneity being the main peculiarity of common networks differing them from supercomputers. The heterogeneity is displayed at least in two forms. Firstly, in the form of heterogeneity of machine arithmetics of such parallel systems. Related challenges existing in writing reliable numerical library software for heterogeneous computing environments have been analyzed in [1]. Secondly, in the form of heterogeneity of both performances of individual processors and speeds of data transfer between the processors. As a rule, to solve linear algebra problems on a heterogeneous network of computers one uses numeric software originally developed for homogeneous distr ibuted-memory machines and later on ported to the network. As a rule, while computing on such homogeneous computer systems, a strategy of homogeneous distribution of computations over processors is used. The strategy will be referred as the HoBo strategy "Homogeneous distribution of processes over processors Homogeneous distribution of data over the processes", with each physical processor running one process and data being evenly parti t ioned among the processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heterogeneous Distribution of Computations Solving Linear Algebra Problems on Networks of Heterogeneous Computers

This paper presents and analyzes two different strategies of heterogeneous distribution of computations solving dense linear algebra problems on heterogeneous networks of computers. The first strategy is based on heterogeneous distribution of processes over processors and homogeneous block cyclic distribution of data over the processes. The second is based on homogeneous distribution of process...

متن کامل

mpC + ScaLAPACK = Efficient Solving Linear Algebra Problems on Heterogeneous Networks

The paper presents experience of using mpC for accelerating ScaLAPACK applications on heterogeneous networks of computers. The mpC is a language, specially designed for parallel programming for heterogeneous networks. It has facilities for distribution of participating processes over processors in accordance with performances of the latters. An mpC application carring out Cholesky factorization...

متن کامل

Experiments with Mpc: Eecient Solving Regular Problems on Heterogeneous Networks of Computers via Irregularization

mpC is a medium-level parallel language for programming heterogeneous networks of computers. It allows to write libraries of parallel routines adaptable to peculiarities of any particular executing mul-tiprocessor system to ensure eecient running. The adaptable routines distribute data and computations in accordance with performances of participating processors. In this case even the problems t...

متن کامل

A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers)

ÐIn this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication or linear system solvers, on heterogeneous networks of workstations. The uniform block-cyclic data distribution scheme commonly used for homogeneous collections of processors limits the performance of these linear algebra kernels on heterogeneous grids to the speed of the slowest processor...

متن کامل

Natural Block Data Decomposition for Heterogeneous Clusters

We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional grid. This heuristics is an extension of the intuitively clear heterogeneous data distribution for one-dimensional case. It is compared to advanced heuristics for heterogeneous data decomposition proposed for solving li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999